Routing on asynchronous processor networks ?

In this work we present models for asynchronous networks and their motivation and use them for the analysis of routing algorithms. We try to construct them in a way that they can be both realistic and easy to work with. For some of the models presented here variants of techniques used in the analysis of synchronous routing, like the delay sequence argument, can be adapted. On the other hand, for others we can only prove large upper bounds for any routing protocol. However, we present a model for which it seems possible to get better than trivial upper bounds, although known proof techniques (like the delay sequence argument) cannot be applied.